Computing Square Roots using the Babylonian Method
نویسنده
چکیده
We implement the Babylonian method [1] to compute square roots of numbers. We provide precise algorithms for naturals, integers and rationals, and offer an approximation algorithm for linear ordered fields.
منابع مشابه
Computing N-th Roots using the Babylonian Method∗
We implement the Babylonian method [1] to compute n-th roots of numbers. We provide precise algorithms for naturals, integers and rationals, and offer an approximation algorithm for square roots within linear ordered fields. Moreover, there are precise algorithms to compute the floor and the ceiling of n-th roots.
متن کاملThe Babylonian Method and Higher Order Approximations to Square Roots
It may have been Chebyshev who said that in the olden days the mathematical problems were posed by the gods, later by the demi-gods (Gauss, etc.) and nowadays by the technician. Modern demands by technology are growing and often (paradoxically) lamented by designers of courses and syllabi. Arguments that fundamentals have to be established rst, leave the fear that applications and philosophical...
متن کاملEla Structure-preserving Schur Methods for Computing Square Roots of Real Skew-hamiltonian Matrices∗
The contribution in this paper is two-folded. First, a complete characterization is given of the square roots of a real nonsingular skew-Hamiltonian matrix W . Using the known fact that every real skew-Hamiltonian matrix has infinitely many real Hamiltonian square roots, such square roots are described. Second, a structure-exploiting method is proposed for computing square roots of W , skew-Ham...
متن کاملStructure-preserving Schur methods for computing square roots of real skew-Hamiltonian matrices
The contribution in this paper is two-folded. First, a complete characterization is given of the square roots of a real nonsingular skew-Hamiltonian matrix W . Using the known fact that every real skew-Hamiltonian matrix has infinitely many real Hamiltonian square roots, such square roots are described. Second, a structure-exploiting method is proposed for computing square roots of W , skew-Ham...
متن کاملBabylonian resistor networks
The ancient Babylonians had an iterative technique for numerically approximating the values of square roots. Their method can be physically implemented using series and parallel resistor networks. A recursive formula for the equivalent resistance Req is developed and converted into a nonrecursive solution for circuits using geometrically increasing numbers of identical resistors. As an example,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Archive of Formal Proofs
دوره 2013 شماره
صفحات -
تاریخ انتشار 2013